Advanced rank/select data structures: succinctness, bounds, and applications

نویسندگان

  • Alessio Orlandi
  • Roberto Grossi
  • Kunihiko Sadakane
چکیده

Acknowledgements This thesis is the end of a long, 4 year journey full of wonders, obstacles, aspirations and setbacks. From the person who cautiously set foot in Pisa to the guy who left his own country, none of these steps would have been possible without the right people at the right moment, supporting me through the dark moments of my life and being with me enjoying the bright ones. First of all, I need to thank Prof. Roberto Grossi, who decided that he could accept me as a Ph.D. Student. Little he knew of what was ahead :). Still, he bailed me out of trouble multiple times, provided invaluable support and insight, helping me grow both as a person and as a scientist. I also owe a lot to Prof. Rajeev Raman, who has been a valuable, patient and welcoming co-author. I also want to thank Proff. Sebastiano Vigna and Paolo Boldi, who although they were less present in the last years, they nurtured my passion for computer science and introduced me to their branch of research. Also Prof. Degano, as head of the Ph.D. course, provided me with non-trivial help during these years. In Pisa, I met a lot of interesting people who were crucial for my happiness, was it when studying on a Sunday, on a boring the-proof-does-not-work-again day, in moments of real need, or on a Saturday night. Hence, this goes to Matteo S., And of course, I cannot forget my office mates, Giovanni and Giuseppe, who provided valuable lessons of Sicilian and managed not to kill me because of the open door. Also, the last year has been full of changes and important steps in my life. I doubt this thesis would never have been printed if it weren't for you, You guys know what I am talking about. Beyond this, I need to thank my family, whose love and support provided me with the help one need when facing the unknowns of almost 4 years as a grad student. I want to end by saying that it is hard to find people who have the bravery to believe in you, to enjoy your life with, to trust you, to share the little triumphs, the 4 big losses, the hard lessons as well a laugh on the sunset on the beach, the kindness of a tear, or the inspiration and the passion that drives you through. …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Lower Bounds for Rank and Select Indexes

We develop a new lower bound technique for data structures. We show an optimal Ω(n lg lgn/ lgn) space lower bounds for storing an index that allows to implement rank and select queries on a bit vector B provided that B is stored explicitly. These results improve upon [Miltersen, SODA’05]. We show Ω((m/t) lg t) lower bounds for storing rank/select index in the case where B has m 1-bits in it (e....

متن کامل

New Lower and Upper Bounds for Representing Sequences

Sequence representations supporting queries access, select and rank are at the core of many data structures. There is a considerable gap between different upper bounds, and the few lower bounds, known for such representations, and how they interact with the space used. In this article we prove a strong lower bound for rank, which holds for rather permissive assumptions on the space used, and gi...

متن کامل

Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices which occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees and posting lists. Labeled trees are applied in XM...

متن کامل

A Framework for Dynamizing Succinct Data Structures

We present a framework to dynamize succinct data structures, to encourage their use over non-succinct versions in a wide variety of important application areas. Our framework can dynamize most stateof-the-art succinct data structures for dictionaries, ordinal trees, labeled trees, and text collections. Of particular note is its direct application to XML indexing structures that answer subpath q...

متن کامل

Broadword Implementation of Rank/Select Queries

Research on succinct data structures (data structures occupying space close to the informationtheoretical lower bound, but achieving speed similar to their standard counterparts) has steadily increased in the last few years. However, many theoretical constructions providing asymptotically optimal bounds are unusable in practise because of the very large constants involved. The study of practica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012